Resolution and the Integrality of Satis abilityProblems
نویسنده
چکیده
A satissability problem can be regarded as a nondisjoint union of set covering problems. We show that if the resolution method of theorem proving is applied to the satissability problem, its constraint set deenes an integral polytope if and only if the constraint sets of the set covering problems do. In this sense, resolution reduces the integrality question for the satissability problem to that for the set covering problem.
منابع مشابه
Resolution and the integrality of satisfiability problems
A satis ability problem can be regarded as a nondisjoint union of set covering problems We show that if the resolution method of theorem proving is applied to the satis ability problem its constraint set de nes an integral polytope if and only if the constraint sets of the set covering problems do In this sense resolution reduces the integrality question for the satis ability problem to that fo...
متن کاملA Note on the Integrality Gap in the Nodal Interdiction Problem
In the maximum flow network interdiction problem, an attacker attempts to minimize the maximum flow by interdicting flow on the arcs of network. In this paper, our focus is on the nodal interdiction for network instead of the arc interdiction. Two path inequalities for the node-only interdiction problem are represented. It has been proved that the integrality gap of relaxation of the maximum fl...
متن کاملEXTENSION OF FUZZY CONTRACTION MAPPINGS
In a fuzzy metric space (X;M; *), where * is a continuous t-norm,a locally fuzzy contraction mapping is de ned. It is proved that any locally fuzzy contraction mapping is a global fuzzy contractive. Also, if f satis es the locally fuzzy contractivity condition then it satis es the global fuzzy contrac-tivity condition.
متن کاملPropositional Search with k-Clause Introduction Can be Polynomially Simulated by Resolution
Purdom proposed \complement search" as a method to introduce additional constraints into a satis ability search, without changing whether the formula is satis able, with the hope of reducing the amount of search. Kullmann proposed \blocked-clause introduction", which is closely related to \complement search", with the same aim. This paper generalizes the concept of \blocked clause" to \nondecis...
متن کاملPool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning
Pool Resolution for propositional CNF formulas is introduced. Its relationship to state-of-the-art satis ability solvers is explained. Every regular-resolution derivation is also a pool-resolution derivation. It is shown that a certain family of formulas, called NT (n) has polynomial sized pool-resolution refutations, whereas the shortest regular refutations have an exponential lower bound. Thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995